The equational definability of truth predicates
نویسنده
چکیده
By a ‘logic’ we mean here a substitution-invariant consequence relation on formulas over an algebraic signature. Propositional logics are obvious examples, but even first order logic can be re-formulated in this way. The notion of an ‘algebraizable’ logic was made precise in the 1980s, mainly by Blok and Pigozzi, who provided intrinsic characterizations of the logics that are indeed algebraizable. One of their characterizations yields a practical strategy for showing that a logic is inherently non-algebraizable. The meaning of ‘algebraizable’ decomposes into two parts. In a slogan,
منابع مشابه
James G . RAFTERY THE EQUATIONAL DEFINABILITY OF TRUTH PREDICATES In memory of Willem Blok
Received 6 July 2005
متن کاملPreface: In memory of Wim Blok
algebraic logic: Full models, Frege systems, and metalogical properties he formulates an institutional analogue of the property of congruence and analyses how it helps in the preservation of other metalogical properties such as conjunction, disjunction, the deduction-detachment theorem, and two versions of reductio ad absurdum. In partial contrast, Raftery’s paper The equational definability of...
متن کاملDefinability in the lattice of equational theories of semigroups
We study first-order definability in the lattice L of equational theories of semigroups. A large collection of individual theories and some interesting sets of theories are definable in L . As examples, if T is either the equational theory of a finite semigroup or a finitely axiomatizable locally finite theory, then the set {T, T } is definable, where T ∂ is the dual theory obtained by invertin...
متن کاملDefinability for Equational Theories of Commutative Groupoids †
We find several large classes of equations with the property that every automorphism of the lattice of equational theories of commutative groupoids fixes any equational theory generated by such equations, and every equational theory generated by finitely many such equations is a definable element of the lattice. We conjecture that the lattice has no non-identical automorphisms.
متن کاملDefinability in the Lattice of Equational Theories of Commutative Semigroups
In this paper we study first-order definability in the lattice of equational theories of commutative semigroups. In a series of papers, J. Ježek, solving problems posed by A. Tarski and R. McKenzie, has proved, in particular, that each equational theory is first-order definable in the lattice of equational theories of a given type, up to automorphism, and that such lattices have no automorphism...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Reports on Mathematical Logic
دوره 41 شماره
صفحات -
تاریخ انتشار 2006